A Frequent Pattern Conjunction Heuristic for Rule Generation in Data Streams
نویسندگان
چکیده
This paper introduces a new and expressive algorithm for inducing descriptive rule-sets from streaming data in real-time order to describe frequent patterns explicitly encoded the stream. Data Stream Mining (DSM) is concerned with automatic analysis of streams real-time. Rapid flows challenge state-of-the art processing communication infrastructure, hence motivation research innovation into algorithms that analyse on-the-fly can automatically adapt concept drifts. To date, DSM techniques have largely focused on predictive mining applications aim forecast value particular target feature unseen instances, answering questions such as whether credit card transaction fraudulent or not. A real-time, technique has not been previously established part toolkit. motivated work reported this paper, which resulted developing validating Generalised Rule Induction (GRI) tool, thus producing rules explanations be easily understood by human analysts. The expressiveness decision models serves objectives transparency, underpinning vision ‘explainable AI’ yet an area attracted less attention despite being high practical importance. introduced described termed Fast (FGRI). FGRI able induce incrementally raw both categorical numerical features. changes pattern stream (concept drift) fly arrives applied continuously also provides theoretical, qualitative empirical evaluation FGRI.
منابع مشابه
Frequent Pattern Mining in Data Streams
Frequent pattern mining is a core data mining operation and has been extensively studied over the last decade. Recently, mining frequent patterns over data streams have attracted a lot of research interests. Compared with other streaming queries, frequent pattern mining poses great challenges due to high memory and computational costs, and accuracy requirement of the mining results. In this cha...
متن کاملFrequent Pattern Mining Algorithms for Finding Associated Frequent Patterns for Data Streams: A Survey
Pattern recognition is seen as a major challenge within the field of data mining and knowledge discovery. For the work in this paper, we have analyzed a range of widely used algorithms for finding frequent patterns with the purpose of discovering how these algorithms can be used to obtain frequent patterns over large transactional databases. This has been presented in the form of a comparative ...
متن کاملFrequent Pattern Mining from Time-Fading Streams of Uncertain Data
Nowadays, streams of data can be continuously generated by sensors in various real-life applications such as environment surveillance. Partially due to the inherited limitation of the sensors, data in these streams can be uncertain. To discover useful knowledge in the form of frequent patterns from streams of uncertain data, a few algorithms have been developed. They mostly use the sliding wind...
متن کاملFrequent Pattern Mining from Dense Graph Streams
As technology advances, streams of data can be produced in many applications such as social networks, sensor networks, bioinformatics, and chemical informatics. These kinds of streaming data share a property in common—namely, they can be modeled in terms of graph-structured data. Here, the data streams generated by graph data sources in these applications are graph streams. To extract implicit,...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2021
ISSN: ['2078-2489']
DOI: https://doi.org/10.3390/info12010024